Scalable Rekeying limited to Subgroup using Hybrid Key Trees
نویسندگان
چکیده
Maintaining security is a critical issue in any group communication protocols. The objective of security in a group communication is to ensure the access only to the legitimate members of the multicast group. The entry and eviction of the members are the main criteria to change the group key and to give them more assurance of a secret communication, which is known as re-keying. Since it is a frequently performed activity during a communication, the group key updating need to be done in a scalable and efficient manner. Earlier, client-server paradigm is the most predominantly used technique for applications like conferencing, chat groups, interactive video gaming, etc which use the concept of unicast for the transmission of data. Present day advancements in the Internet technologies, especially the increase of bandwidth are definitely encouraging environment for new developments. Unlike the old communication models, where the delivery of the packets are to be carried out in an unicast model, multicasting technique provides an efficient delivery service to larger user-community with effective and efficient network resource utilization.
منابع مشابه
An Adaptive Hybrid Rekeying Protocol for Dynamic Multicast Groups
In secure multi-party communications, the Logical Key Hierarchy scheme has been proved to be communication optimal for large groups. However, this scheme still suffers from an expensive rekeying cost when the group is very dynamic. To reduce the rekeying cost, Zhu et al. suggested to partition the logical key tree in two sub-trees based on the duration of each member in the multicast group. Alt...
متن کاملPerformance Optimizations for Group Key Management Schemes for Secure Multicast
Scalable group rekeying is one of the biggest challenges that need to be addressed to support secure communications for large and dynamic groups. In recent years, many group key management approaches based on the use of logical key trees have been proposed to address this issue. Using logical key trees reduces the complexity of group rekeying operation from O(N) to O(logN), where N is the group...
متن کاملA Scalable and Reliable Key Distribution Protocol for Multicast Group Rekeying
Scalable group rekeying is one of the important problems that needs to be addressed in order to support secure communications for large and dynamic groups. One of the challenging issues that arises in scalable group rekeying is the problem of delivering the updated keys to the members of the group in a reliable and timely manner. In this paper, we present a new scalable and reliable key distrib...
متن کاملRecommendations in Using Group Key Management Algorithms
Scalable group key management (also known as group rekeying) schemes proposed in the literature can be classified into three categories: stateful schemes, stateless schemes and self-healing schemes. These schemes differ mainly on the interdependency of rekey messages and rekeying overhead. Logical key hierarchy (LKH) based approaches are stateful in that members should have received past rekeyi...
متن کاملMultiway Tree-Based Group Key Management Using Chinese Remainder Theorem for Multi-Privileged Group Communications
Key management becomes more difficult in multi-privileged communications due to the dynamic membership and the complex relations between users and resources. In this paper, we propose a novel key management scheme in which the key graph is based on multiway trees. Chinese remainder theorem is employed to combine some encrypted rekeying materials into a short message for rekeying. As a result, u...
متن کامل